package com.test.daily.leetcode.y2022.m07.day0701.v10;

/**
 * @author Tom on 2022/7/3
 */
public class Solution {
    // 在arr上, 找到满足 >= value最左侧位置
    public int leftestMore(int[] arr, int target){
        int  L = 0, R = arr.length - 1, mid = 0;
        int index = -1;
        while(L <= R){
            if(arr[mid] > target){
                R = mid - 1;
                index = mid;
            } else {
                L = mid + 1;
            }
        }
        return index;
    }
}
